This paper presents and solves the maximum throughput dynamic network flow problem, an infinite horizon integer programming problem which involves network flows evolving over time. The model is a finite network in which the flow on each arc not only has an associated upper and lower bound but also an associated transit time. Flow is to be sent through the network in each period so as to satisfy...

rapid urban growth is resulting into increase in travel demand and private vehicle ownership in urban areas. in the present scenario the existing infrastructure has failed to match the demand that leads to traffic congestion, vehicular pollution and accidents. with traffic congestion augmentation on the road, delay of commuters has increased and reliability of road network has decreased. four s...

Guiding vehicles to their destination under dynamic traffic conditions is an important topic in the field of Intelligent Transportation Systems (ITS). Nowadays, many complex systems can be controlled by using multi agent systems. Adaptation with the current condition is an important feature of the agents. In this research, formulation of dynamic guidance for vehicles has been investigated based...

guiding vehicles to their destination under dynamic traffic conditions is an important topic in the field of intelligent transportation systems (its). nowadays, many complex systems can be controlled by using multi agent systems. adaptation with the current condition is an important feature of the agents. in this research, formulation of dynamic guidance for vehicles has been investigated based...

In both transportation and communication networks we are faced with “selfish flows”, where every agent sending flow over the network desires to get it to its destination as soon as possible. Such flows have been well studied in time-invariant networks in the last few years. A key observation that must be taken into account in defining and studying selfish flow, however, is that a flow can take ...

The need for more realistic network models led to the development of the dynamic network flow theory. In dynamic flow models it takes time for the flow to pass an arc, the flow can be delayed at nodes, and the network parameters, e.g., the arc capacities, can change in time. Surprisingly perhaps, despite being closer to reality, dynamic flow models have been overshadowed by the classical, stati...

This paper presents and solves in polynomial time the minimum convex cost dynamic network flow problem, an infinite horizon integer programming problem which involves network flows evolving over time. The model is a finite network in which each arc has an associated transit time for flow to pass through it. An integral amount of flow is to be sent through arcs of the network in each period over...

Next-generation Grids will require flexible and adaptive network infrastructures that would be able to provide the requisite quality of service for computational flows. We discuss a mechanism where network flows are tagged with network context information, triggering dynamic network services, including QoS and adaptation services. An incremental deployment strategy and some initial results are ...